The Dedekind completion ofC(𝒳)
نویسندگان
چکیده
منابع مشابه
Stepwise Construction of the Dedekind-MacNeille Completion
form a complete lattice, the D e d e k i n d M a c N e i l l e c o m p l e t i o n (or short comp l e t i o n ) of (P, <). It is the smallest complete lattice containing a subset orderisomorphic with (P, <). The size of the completion may be exponential in [PI. The completion can be computed in steps: first complete a small part of (P, <), then add another element, complete again, et cetera. Ea...
متن کاملDedekind-MacNeille Completion of n-Lattices
A completion of an n-lattice L = 〈L,.1, . . . , .n〉 is defined, by analogy with lattices, as a pair 〈e,C〉, where C is a complete n-lattice and e : L → C is an n-lattice embedding. The Basic Theorem of Polyadic Concept Analysis is exploited to construct a completion of an arbitrary n-lattice. The completion reduces to the Dedekind-MacNeille completion in the dyadic case, which was first formulat...
متن کاملDedekind-MacNeille Completion and Multi-adjoint Lattices
Among other applications, multi-adjoint lattices have been successfully used for modeling flexible notions of truth-degrees in the fuzzy extension of logic programming called MALP (Multi-Adjoint Logic Programming). In this paper we focus in the completion of such mathematical construct by adapting the classical notion of Dedekind-MacNeille in order to relax this usual hypothesis on such kind of...
متن کاملDedekind-MacNeille Completion of n -ordered Sets
A completion of an n-ordered set P = 〈P, 1, . . . , n〉 is defined, by analogy with the case of posets (2-ordered sets), as a pair 〈e,Q〉, where Q is a complete n-lattice and e : P → Q is an n-order embedding. The Basic Theorem of Polyadic Concept Analysis is exploited to construct a completion of an arbitrary nordered set. The completion reduces to the Dedekind–MacNeille completion in the dyadic...
متن کاملDedekind completion as a method for constructing new Scott domains
Many operations exist for constructing Scott-domains. This paper presents Dedekind completion as a new operation for constructing such domains and outlines an application of the operation. Dedekind complete Scott domains are of particular interest when modeling versions of λ-calculus that allow quantification over sets of arbitrary cardinality. Hence, it is of interest when constructing models ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1967
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1967.20.231